Node-Packing Problems with Integer Rounding Properties
نویسندگان
چکیده
منابع مشابه
Solving Packing Integer Programs via Randomized Rounding with Alterations
We give new approximation algorithms for packing integer programs (PIPs) by employing the method of randomized rounding combined with alterations. Our first result is a simpler approximation algorithm for general PIPs which matches the best known bounds, and which admits an efficient parallel implementation. We also extend these results to a multi-criteria version of PIPs. Our second result is ...
متن کاملA feasible rounding approach for mixed-integer nonlinear optimization problems
We introduce a new technique to generate good feasible points of mixedinteger nonlinear optimization problems. It makes use of the so-called inner parallel set of the relaxed feasible set, which was employed in O. Stein, Error bounds for mixed integer linear optimization problems, Mathematical Programming, Vol. 156 (2016), 101–123, as well as O. Stein, Error bounds for mixed integer nonlinear o...
متن کاملEfficient Snap Rounding with Integer Arithmetic
In this paper we present a slightly modified definition of snap rounding, and provide two efficient algorithms that perform this rounding. The first algorithm takes n line segments as input and generates the set of snapped segments in O(|I| + Σc is(c) log n + |I∗ m|), where |I| is the complexity of the unrounded arrangement I, is(c) is the number of segments that have an intersection or endpoin...
متن کاملMingling: mixed-integer rounding with bounds
Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This i...
متن کاملConic mixed-integer rounding cuts
A conic integer program is an integer programming problem with conic constraints.Manyproblems infinance, engineering, statistical learning, andprobabilistic optimization aremodeled using conic constraints. Herewe studymixed-integer sets definedby second-order conic constraints.We introduce general-purpose cuts for conic mixed-integer programming based on polyhedral conic substructures of second...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1989
ISSN: 0895-4801,1095-7146
DOI: 10.1137/0402036